#include <iostream>
#include <algorithm>
#include <vector>

int const maxn = 2000;
bool vis[maxn];
std::vector<int> a;
int n;

int main()
{
	std::cin >> n;
	a.resize(n);
	for (int i = 0; i < n; i++) std::cin >> a[i];
	std::sort(a.begin(), a.end(), std::greater<int>());
	int ans = 0;
	for (int i = 0; i < n; i++) {
		if (vis[i]) continue;
		vis[i] = true;
		int t = a[i];
		for (int j = i + 1; j < n; j++) {
			if (vis[j]) continue;
			if (a[j] < t) {
				t = a[j];
				vis[j] = true;
			}
		}
		ans++;
	}
	std::cout << ans << '\n';
}

